Self-avoiding random walks on lattice strips.
نویسندگان
چکیده
A self-avoiding walk on an infinitely long lattice strip of finite width will asymptotically exhibit an end-to-end separation proportional to the number of steps. A proof of this proposition is presented together with comments concerning an earlier attempt to deal with the matter. In addition, some unproved, yet "obvious," conjectures concerning self-avoiding walks are cited as basic propositions requiring study.
منابع مشابه
Enumeration of compact self-avoiding walks
We have developed a transfer matrix algorithm for the enumeration of compact self-avoiding walks on rectangular strips of the square lattice. The algorithm is easily adapted to other shapes or generalized to problems such as interacting walks. These models are relevant in the study of globular proteins. 2001 Elsevier Science B.V. All rights reserved. PACS: 05.50.+q; 02.70.Rw; 61.25.Hq
متن کاملBilocal Dynamics for Self-Avoiding Walks
We introduce several bilocal algorithms for lattice self-avoiding walks that provide reasonable models for the physical kinetics of polymers in the absence of hydrodynamic effects. We discuss their ergodicity in different confined geometries, for instance in strips and in slabs. A short discussion of the dynamical properties in the absence of interactions is given.
متن کاملSelf-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
We study self-avoiding and neighbour-avoiding walks and lattice trails on two semiregular lattices, the (3.122) lattice and the (4.82) lattice. For the (3.122) lattice we find the exact connective constant for both self-avoiding walks, neighbour-avoiding walks and trails. For the (4.82) lattice we generate long series which permit the accurate estimation of the connective constant for self-avoi...
متن کاملar X iv : c on d - m at / 9 40 80 97 v 1 3 1 A ug 1 99 4 Lattice Green Function ( at 0 ) for the 4 d Hypercubic Lattice
The generating function for recurrent Polya walks on the four dimensional hypercubic lattice is expressed as a Kampé-de-Fériet function. Various properties of the associated walks are enumerated. Lattice statistics play an important role in many areas of chemistry and statistical physics. Random lattice walks have been investigated extensively, both numerically and analytically, and explicit an...
متن کاملSelf-avoiding walks and trails on the 3.12 lattice
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Proceedings of the National Academy of Sciences of the United States of America
دوره 76 4 شماره
صفحات -
تاریخ انتشار 1979